Dc coefficient signaling at small quantization step sizes

ABSTRACT

Described tools and techniques relate to signaling for DC coefficients at small quantization step sizes. The techniques and tools can be used in combination or independently. For example, a tool such as a video encoder or decoder processes a VLC that indicates a DC differential for a DC coefficient, a FLC that indicates a value refinement for the DC differential, and a third code that indicates the sign for the DC differential. Even with the small quantization step sizes, the tool uses a VLC table with DC differentials for DC coefficients above the small quantization step sizes. The FLCs for DC differentials have lengths that vary depending on quantization step size.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional PatentApplication Ser. No. 60/488,710, filed Jul. 18, 2003, the disclosure ofwhich is incorporated herein by reference. This application also is acontinuation-in-part of U.S. patent application Ser. No. 10/623,195,filed Jul. 18, 2003, the disclosure of which is incorporated herein byreference.

COPYRIGHT AUTHORIZATION

A portion of the disclosure of this patent document contains materialwhich is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by any one of the patentdisclosure, as it appears in the Patent and Trademark Office patentfiles or records, but otherwise reserves all copyright rightswhatsoever.

TECHNICAL FIELD

The invention relates generally to video and other digital media codingand decoding, and more particularly relates to signaling DC coefficientsin video and other digital media coding and decoding.

BACKGROUND

With the increased popularity of DVDs, music delivery over the Internet,and digital cameras, digital media have become commonplace. Engineersuse a variety of techniques to process digital audio, video, and imagesefficiently while still maintaining quality. To understand thesetechniques, it helps to understand how the audio, video, and imageinformation is represented and processed in a computer.

I. Representation of Media Information in a Computer

A computer processes media information as a series of numbersrepresenting that information. For example, a single number mayrepresent the intensity of brightness or the intensity of a colorcomponent such as red, green or blue for each elementary small region ofa picture, so that the digital representation of the picture consists ofone or more arrays of such numbers. Each such number may be referred toas a sample. For a color image, it is conventional to use more than onesample to represent the color of each elemental region, and typicallythree samples are used. The set of these samples for an elemental regionmay be referred to as a pixel, where the word “pixel” is a contractionreferring to the concept of a “picture element.” For example, one pixelmay consist of three samples that represent the intensity of red, greenand blue light necessary to represent the elemental region. Such a pixeltype is referred to as an RGB pixel. Several factors affect quality,including sample depth, resolution, and frame rate (for video).

Sample depth is a property normally measured in bits that indicates therange of numbers that can be used to represent a sample. When morevalues are possible for the sample, quality can be higher because thenumber can capture more subtle variations in intensity and/or a greaterrange of values. Images with higher resolution tend to look crisper thanother images and contain more discernable useful details. Video withhigher frame rate tends to mimic the smooth motion of natural objectsbetter than other video, and can similarly be considered to contain moredetail in the temporal dimension. For all of these factors, the tradeofffor high quality is the cost of storing and transmitting the informationin terms of the bit rate necessary to represent the sample depth,resolution and frame rate, as Table 1 shows.

TABLE 1 Bit rates for different quality levels of raw video Bits PerPixel Resolution Bit Rate (sample depth (in pixels, Frame Rate (inmillions times samples Width × (in frames of bits per pixel) Height) persecond) per second) 8 (value 0-255, 160 × 120 7.5 1.2 monochrome) 24(value 0-255, 320 × 240 15 27.6 RGB) 24 (value 0-255, 640 × 480 30 221.2RGB) 24 (value 0-255, 1280 × 720  60 1327.1 RGB)

Despite the high bit rate necessary for sending high quality video (suchas HDTV), companies and consumers increasingly depend on computers tocreate, distribute, and play back high quality content. For this reason,engineers use compression (also called source coding or source encoding)to reduce the bit rate of digital media. Compression decreases the costof storing and transmitting the information by converting theinformation into a lower bit rate form. Decompression (also calleddecoding) reconstructs a version of the original information from thecompressed form. A “codec” is an encoder/decoder system. Two categoriesof compression are lossless compression and lossy compression.

Lossless compression reduces the bit rate of information by removingredundancy from the information without any reduction in fidelity. Forexample, a series of ten consecutive pixels that are all exactly thesame shade of red could be represented as a code for the particularshade of red and the number ten as a “run length” of consecutive pixels,and this series can be perfectly reconstructed by decompression from thecode for the shade of red and the indicated number (ten) of consecutivepixels having that shade of red. Lossless compression techniques reducebit rate at no cost to quality, but can only reduce bit rate up to acertain point. Decreases in bit rate are limited by the inherent amountof variability in the statistical characterization of the input data,which is referred to as the source entropy. Entropy coding is anotherterm for lossless compression.

In contrast, with lossy compression, the quality suffers somewhat butthe achievable decrease in bit rate is more dramatic. For example, aseries often pixels, each being a slightly different shade of red, canbe approximated as ten pixels with exactly the same particularapproximate red color. Lossy compression techniques can be used toreduce bit rate more than lossless compression techniques, but some ofthe reduction in bit rate is achieved by reducing quality, and the lostquality cannot be completely recovered, Lossy compression is often usedin conjunction with lossless compression—in a system design in which thelossy compression establishes an approximation of the information andlossless compression techniques are applied to represent theapproximation. For example, the series often pixels, each a slightlydifferent shade of red, can be represented as a code for one particularshade of red and the number ten as a run-length of consecutive pixels.In decompression, the original series would then be reconstructed as tenpixels with the same approximated red color.

II. Quantization

According to one possible definition, quantization is a term used for anapproximating non-reversible mapping function commonly used for lossycompression, in which there is a specified set of possible outputvalues, and each member of the set of possible output values has anassociated set of input values that result in the selection of thatparticular output value. A variety of quantization techniques have beendeveloped, including scalar or vector, uniform or non-uniform, andadaptive or non-adaptive quantization.

A. Scalar Quantizers According to one possible definition, a scalarquantizer is an approximating functional mapping x→Q[x] of an inputvalue x to a quantized value Q[x]. FIG. 1 shows a “staircase” I/Ofunction (100) for a scalar quantizer. The horizontal axis is a numberline for a real number input variable x, and the vertical axis indicatesthe corresponding quantized values Q[x]. The number line is partitionedby thresholds such as the threshold (110). Each value of x within agiven range between a pair of adjacent thresholds is assigned the samequantized value Q[x]. For example, each value of x within the range(120) is assigned the same quantized value (130). (At a threshold, oneof the two possible quantized values is assigned to an input x,depending on the system.) Overall, the quantized values Q[x] exhibit adiscontinuous, staircase pattern. The distance the mapping continuesalong the number line depends on the system, typically ending after afinite number of thresholds. The placement of the thresholds on thenumber line may be uniformly spaced (as shown in FIG. 1) ornon-uniformly spaced.

A scalar quantizer can be decomposed into two distinct stages. The firststage is the classifier stage, in which a classifier function mappingx→A[x] maps an input x to a quantization index A[x], which is ofteninteger-valued. In essence, the classifier segments an input number lineor data set. FIG. 2a shows a generalized classifier (200) and thresholdsfor a scalar quantizer. As in FIG. 1, a number line for a real numbervariable x is segmented by thresholds such as the threshold (210). Eachvalue of x within a given range such as the range (220) is assigned thesame quantized value Q[x]. FIG. 2b shows a numerical example of aclassifier (250) and thresholds for a scalar quantizer.

In the second stage, a reconstructor functional mapping k→β[k] maps eachquantization index k to a reconstruction value β[k]. In essence, thereconstructor places steps having a particular height relative to theinput number line segments (or selects a subset of data set values) forreconstruction of each region determined by the classifier.

The reconstructor functional mapping may be implemented, for example,using a lookup table. Overall, the classifier relates to thereconstructor as follows:

Q[x]=β[A[x]]  (1).

The distortion introduced by using such a quantizer may be computed witha difference-based distortion measure d(x−Q[x]). Typically, such adistortion measure has the property that d(x−Q[x]) increases as x−Q[x]deviates from zero; and typically each reconstruction value lies withinthe range of the corresponding classification region, so that thestraight line that would be formed by the functional equation Q[x]=xwill pass through every step of the staircase diagram (as shown inFIG. 1) and therefore Q[Q[x]] will typically be equal to Q[x]. Ingeneral, a quantizer is considered better in rate-distortion terms ifthe quantizer results in a lower average value of distortion than otherquantizers for a given bit rate of output. More formally, a quantizer isconsidered better if, for a source random variable X, the expected(i.e., the average or statistical mean) value of the distortion measureD=E_(X){d(X-Q[X])} is lower for an equal or lower entropy H of A[X]. Themost commonly-used distortion measure is the squared error distortionmeasure, for which d(|x−y|)=|x−y|². When the squared error distortionmeasure is used, the expected value of the distortion measure (D) isreferred to as the mean squared error.

B. Dead Zone+Uniform Threshold Quantizers

According to one possible definition, a dead zone plus uniform thresholdquantizer [“DZ+UTQ” ] is a quantizer with uniformly spaced thresholdvalues for all classifier regions except the one containing the zeroinput value (which is called the dead zone [“DZ” ]). A DZ+UTQ has aclassifier index mapping rule x→A[x] that can be expressed based on twoparameters. FIG. 3 shows a staircase I/O function (300) for a DZ+UTQ,and FIG. 4a shows a generalized classifier (400) and thresholds for aDZ+UTQ. The parameter s, which is greater than 0, indicates the stepsize for all steps other than the DZ. Mathematically, all s_(i) areequal to s for i≠0. The parameter z, which is greater than or equal to0, indicates the ratio of the DZ size to the size of the other steps.Mathematically, s₀=z·s. In FIG. 4a, z is 2, so the DZ is twice as wideas the other classification zones. The index mapping rule x→A[x] for aDZ+UTQ can be expressed as:

$\begin{matrix}{{{A\lbrack x\rbrack} = {{{sign}\mspace{11mu} (x)} \star {\max \mspace{11mu} \left( {0,\left\lfloor {\frac{x}{s} - \frac{z}{2} + 1} \right\rfloor} \right)}}},} & (2)\end{matrix}$

where └·┘ denotes the smallest integer less than or equal to theargument and where sign(x) is the function defined as:

$\begin{matrix}{{{sign}\mspace{11mu} (x)} = \left\{ \begin{matrix}{{+ 1},} & {{{{for}\mspace{14mu} x} \geq 0},} \\{{- 1},} & {{{for}\mspace{14mu} x} < 0.}\end{matrix} \right.} & {(3).}\end{matrix}$

FIG. 4b shows a numerical example of a classifier (450) and thresholdsfor a DZ+UTQ with s=1 and z=2. FIGS. 1, 2 a, and 2 b show a special caseDZ+UTQ with z=1. Quantizers of the UTQ form have good performance for avariety of statistical sources. In particular, the DZ+UTQ form isoptimal for the statistical random variable source known as theLaplacian source.

In some system designs (not shown), an additional consideration may benecessary to fully characterize a DZ+UTQ classification rule. Forpractical reasons there may be a need to limit the range of values thatcan result from the classification function A[x] to some reasonablefinite range. This limitation is referred to as clipping. For example,in some such systems the classification rule could more precisely bedefined as:

$\begin{matrix}{{{A\lbrack x\rbrack} = {{{sign}\mspace{11mu} (x)} \star {\min \mspace{11mu}\left\lbrack {g,{\max \mspace{11mu} \left( {0,\left\lfloor {\frac{x}{s} - \frac{z}{2} + 1} \right\rfloor} \right)}} \right\rbrack}}},} & (4)\end{matrix}$

where g is a limit on the absolute value of A[x]. In much of thetheoretical analysis presented herein, consideration of clipping isomitted as it unduly complicates the analysis without advancing theexplanation. Moreover, although the clipping shown in the above exampleis symmetric about zero, the clipping does not need to be symmetric, andoften is not exactly symmetric. For example, a common clipping rangewould be such that the value of A[x] is limited to some range from−2^(B) to +2^(B)−1 so that A[x] can be represented as an integer using atwo's complement representation that uses B+1 bits, where B+1 may beequal to 8 or 16 or another particular selected number of bits.

C. Reconstruction Rules

Different reconstruction rules may be used to determine thereconstruction value for each quantization index. These include theoptimal reconstruction rule and the single offset reconstruction rule(of which the mid-point reconstruction rule is an example). FIG. 5 showsreconstruction points according to different reconstruction rules for aparticular shape of a source probability distribution function ƒ(x). Fora range of values between two thresholds t_(j) and t_(j+1), thereconstruction value r_(j,mid) according to the mid-point reconstructionrule bisects the range (thus, r_(j,mid)=(t_(j)+t_(j+1))/2). For theexample probability distribution function shown in FIG. 5, this fails toaccount for the fact that values to the left of the mid-point are morelikely than values to the right of the mid-point. The reconstructionvalue r_(j,opt) according to the optimal reconstruction rule accountsfor the probability distribution.

In general, a probability distribution function [“pdf”] indicates theprobabilities for the different values of a variable. One possibledefinition of the optimal reconstruction value r_(j,opt) for each regionbetween two neighboring thresholds t_(j) and t_(j+1) for a pdf ƒ(x) canbe expressed as:

$\begin{matrix}{r_{j,{opt}} = {{\min\limits_{y}}^{- 1}\mspace{11mu} {\overset{t_{j + 1}}{\int\limits_{t_{j}}}{{d\left( {x - y} \right)}{f(x)}{{dx}.}}}}} & (5)\end{matrix}$

Assuming that the pdf ƒ(x) for a given source is symmetric around zero,one possible definition of the optimal reconstruction rule of a DZ+UTQfor a symmetric, difference-based distortion measure d(|x−y|) is:

$\begin{matrix}{{\beta \;\lbrack k\rbrack} = \left\{ \begin{matrix}{{{\min\limits_{y}}^{- 1}{\int_{0}^{\frac{zS}{2}}{\left\lbrack {{d\left( {{x - y}} \right)} + {d\left( {{y - x}} \right)}} \right\rbrack {f(x)}{dx}}}},} & {{{{for}\mspace{14mu} k} = 0},} \\{{{sign}\mspace{11mu} (k)\; {{\min\limits_{y}}^{- 1}\; {\int_{\frac{z\; S}{2} + {{({{k} - 1})}s}}^{\frac{zS}{2} + {{k}s}}{{d\left( {{x - y}} \right)}{f(x)}{dx}}}}},} & {{{for}\mspace{14mu} k} \neq 0.}\end{matrix} \right.} & {(6),}\end{matrix}$

where y is the quantized value Q[x], and where the rule finds thequantized value Q[x] that results in the smallest distortion accordingto the distortion measure. Typically, the optimal quantized value forβ[0] is equal to 0, and that will be assumed to be true for theremainder of this description. For minimizing mean squared error, theoptimal reconstruction rule sets the reconstruction value for eachregion equal to the conditional mean of the input values in that region.Stated more precisely, the optimal reconstruction value r_(j,opt) forthe region between two neighboring thresholds t_(j) and t_(j+1) for apdf ƒ(x) when using the mean squared error distortion measure is givenby

$\begin{matrix}{r_{j,{opt}} = {\frac{\underset{t_{j}}{\int\limits^{t_{j + 1}}}{{x \cdot {f(x)}}{dx}}}{\underset{t_{j}}{\int\limits^{t_{j + 1}}}{{f(x)}{dx}}}.}} & (7)\end{matrix}$

According to one possible definition for a DZ+UTQ, the single-offsetreconstruction rule is based on an offset parameter A, where ordinarily0<Δ<s/2, and the rule is:

$\begin{matrix}{{\beta \;\lbrack k\rbrack} = \left\{ \begin{matrix}{0,} & {{{{for}\mspace{14mu} k} = 0},} \\{{{sign}\mspace{11mu} {(k)\left\lbrack {{\left( {{k} + \frac{z}{2} - 1} \right)s} + \Delta} \right\rbrack}},} & {{{for}\mspace{14mu} k} \neq 0.}\end{matrix} \right.} & {(8).}\end{matrix}$

The mid-point reconstruction rule is a special case of the single-offsetreconstruction rule, specified by Δ=s/2. Mid-point reconstruction iscommonly used for convenience due to its simplicity. And, in the limitas s becomes very small, the performance of the mid-point rule becomesoptimal under a variety of well-behaved mathematical conditions.

D. Specifying Reconstruction Values, Constructing Classifiers

Standards and product specifications that focus only on achievinginteroperability will often specify reconstruction values withoutnecessarily specifying the classification rule. In other words, somespecifications may define the functional mapping k→β[k] without definingthe functional mapping x→A[x]. This allows a decoder built to complywith the standard/specification to reconstruct information correctly. Incontrast, encoders are often given the freedom to change the classifierin any way that they wish, while still complying with thestandard/specification.

Numerous systems for adjusting quantization thresholds have beendeveloped. Many standards and products specify reconstruction valuesthat correspond to a typical mid-point reconstruction rule (e.g., for atypical simple classification rule) for the sake of simplicity. Forclassification, however, the thresholds can in fact be adjusted so thatcertain input values will be mapped to more common (and hence, lower bitrate) indices, which makes the reconstruction values closer to optimal.FIG. 6 shows such adjusted thresholds for a classifier (600). Theoriginal thresholds (such as old t_(j)) are situated halfway between thereconstruction points. The thresholds are moved outward on the numberline, away from 0. Before the adjustment, a marginal value (shownbetween the old t_(j) and the new t_(j)) is mapped to r_(j). After theadjustment, the marginal value is mapped to r₀. The decoder performsreconstruction without knowledge of the adjustments done in the encoder.

For optimal encoding, an encoder may adjust quantization thresholds tooptimally fit a given set of reconstruction values as follows. Theprobability p_(j) for the source random variable X to fall within arange j between t_(j) and t_(j+1) (where t_(j+1)>t_(j)) for a source pdfƒ(x) is:

$\begin{matrix}{{p_{j} = {\underset{t_{j}}{\int\limits^{t_{j + 1}}}{{f(x)}{dx}}}},} & (9)\end{matrix}$

and the number of bits necessary to represent an event with probabilityp_(j) in an ideal lossless communication system may be quantified as:

$\begin{matrix}{{h_{j} = {\log_{2}\mspace{11mu} \frac{1}{p_{j}}}},} & (10)\end{matrix}$

where the h_(j) is expressed in terms of bits. The total entropy of theclassifier is then given by

$\begin{matrix}{H = {\sum\limits_{j}{{p_{j} \cdot h_{j}}\mspace{14mu} {{bits}.}}}} & (11)\end{matrix}$

In general, if the encoder is required to use b; bits to indicate theselection of the reconstruction value r_(j), the encoder may evaluateand optimize its thresholds according to minimization of therate-distortion relation D+λR, where D indicates distortion, R indicatesbit usage, and λ is a tuning parameter for favoring a particularselected balance between distortion and bit rate. For each particularthreshold t_(j+1) between two points r_(j) and r_(j+1), the encoder canset t_(j+1) to the x that satisfies:

d(x−r _(j))+λb _(j) =d(x−r _(j+1))+λb _(j+1)  (12).

In an ideal design, b_(j) will be approximately equal to h_(j), andmodern lossless coding techniques can be used to very nearly achievethis goal. In a design using some non-ideal lossless coding technique torepresent the output of the classifier, b_(j) may have some other value.

Note in summation that optimal decision thresholds can be selected usingequation (12), that optimal reconstruction values can be selected usingequation (5) or (7), and that optimal bit usage can be computed bysetting b_(j) equal to h_(j) as given by equation (10) or to the numberof bits used in some other lossless code (such as a Huffman codedesigned using equation (9) or a fixed-length code). In somehighly-optimized scalar quantizer system designs, reconstruction values(initially uniformly spaced) are analyzed to adjust thresholds inencoder analysis, then use of the adjusted thresholds is analyzed to setthe number of bits needed to represent the output of the classifierusing lossless coding and to set the reconstruction values in decoderanalysis. The new reconstruction values are then analyzed to adjustthresholds, and so on, until the thresholds and/or reconstruction valuesstabilize across iterations.

III. Compression and Decompression Systems

In general, video compression techniques include “intra-picture”compression and “inter-picture” compression, where a picture is, forexample, a progressively scanned video frame, an interlaced video frame(having alternating lines for video fields), or an interlaced videofield. For progressive frames, intra-picture compression techniquescompress individual frames (typically called I-frames or key frames),and inter-picture compression techniques compress frames (typicallycalled predicted frames, P-frames, or B-frames) with reference topreceding and/or following frames (typically called reference or anchorframes).

Both intra and inter-picture compression techniques often use areversible frequency transform operation, which generates a set offrequency domain (i.e., spectral) coefficients. For intra-picturecompression, the transform is typically applied to a block of samples.For inter-picture compression, the transform is typically applied to ablock of motion-compensation prediction residual information. A discretecosine transform [“DCT” ] is a type of frequency transform. Theresulting blocks of transform coefficients are quantized and entropyencoded. A decoder typically entropy decodes and reconstructs transformcoefficients (e.g., DCT coefficients) that were quantized and performsan inverse frequency transform such as an IDCT.

A. Intra-Compression in Windows Media Video, Version 8 [“WMV8”]

Microsoft Corporation's Windows Media Video, Version 8 [“WMV8” ]includes a video encoder and a video decoder. The WMV8 encoder usesintra-frame and inter-frame compression, and the WMV8 decoder usesintra-frame and inter-frame decompression.

FIG. 7 illustrates block-based intraframe compression (700) of a 8×8block (705) of samples in a frame in the WMV8 encoder. The WMV8 encoderhere splits a frame into 8×8 blocks of samples and applies an 8×8 DCT(710) to individual blocks such as the block (705). The encoderquantizes (720) the DCT coefficients (715), resulting in an 8×8 block ofquantized DCT coefficients (725). For example, the encoder applies auniform, scalar quantization step size to each coefficient.

Further encoding varies depending on whether a coefficient is a DCcoefficient, an AC coefficient in the top row or left column, or anotherAC coefficient. The encoder encodes the DC coefficient (726) as adifferential from the DC coefficient (736) of a neighboring 8×8 block,which is a previously encoded top or left neighbor block. The encoderentropy encodes (740) the differential. The entropy encoder can encodethe left column or top row of AC coefficients as differentials from acorresponding column or row of a neighboring 8×8 block. FIG. 7 shows theleft column (727) of AC coefficients encoded as differentials (747) fromthe left column (737) of the neighboring (actually situated to the left)block (735). The encoder scans (750) the 8×8 block (745) of predicted,quantized AC DCT coefficients into a one-dimensional array (755) andthen entropy encodes the scanned coefficients using a variation of runlength coding (760). The encoder selects an entropy code from one ormore run/level/last tables (765) and outputs the entropy code.

A WMV8 decoder (not shown) produces a reconstructed version of theoriginal block (705). The decoder determines the DC predictor for the DCcoefficient and decodes the DC differential. In particular, thefollowing pseudocode illustrates the DC differential decoding process inWMV8.

DCDifferential = vlc_decode() if (DCDifferential == ESCAPECODE) DCDifferential = flc_decode(8) DCSign = flc_decode(1) if (DCSign == 1) DCDifferential = -DCDifferential

The WMV8 decoder combines the DC differential with the predictor for theDC coefficient to reconstruct the DC coefficient. The decoder entropydecodes the AC coefficients using one or more run/level/last tables, andscans the coefficients back into a two-dimensional array. The WMVdecoder computes a predictor for the top row or left column of ACcoefficients if appropriate. The decoder inverse quantizes thecoefficients and performs an IDCT.

While DC differential coding and decoding as in WMV8 provide goodperformance in many scenarios, there are opportunities for improvement.In particular, DC differential coding and decoding as in WMV8 are noteasily applied for smaller quantization sizes. This is because at thesmaller quantization sizes, VLC code table size for DC differentialsbecomes inefficiently large for many devices for practical applications.

B. Video Codec Standards

Various standards specify aspects of video decoders as well as formatsfor compressed video information. These standards include H.261, MPEG-1,H.262 (also called MPEG-2), H.263, and MPEG-4. Directly or byimplication, these standards may specify certain encoder details, butother encoder details are not specified. Different standards incorporatedifferent techniques, but each standard typically specifies some kind ofinverse frequency transform and entropy decoding. For information, seethe respective standard documents.

SUMMARY

Described tools and techniques relate to coding of DC coefficients invideo and other digital media coding. More particularly, the techniquesand tools relate to signaling for DC coefficients at small quantizationstep sizes. The techniques and tools can be used in combination orindependently.

According to a first set of tools and techniques, a tool such as a videoencoder or decoder processes a first code that indicates a DCdifferential for a DC coefficient and a second code that indicates avalue refinement for the DC differential. For example, a video encoderencodes the DC coefficient based at least in part on the first andsecond codes. Or, a video decoder reconstructs the DC coefficient duringdecoding based at least in part on the first and second codes.

According to a second set of tools and techniques, a tool such as avideo encoder or decoder processes a VLC for a first DC differential fora first DC coefficient at a first quantization step size. The tool usesa VLC table that indicates DC differentials for DC coefficients at andabove a second quantization step size larger than the first quantizationstep size.

According to a third set of tools and techniques, a tool such as a videoencoder or decoder processes a code for a DC differential for a DCcoefficient, where the code is a FLC having a length that variesdepending on quantization step size. For example, the FLC indicates arefinement value for the DC differential. Or, when an escape code isused for the DC differential, the FLC indicates a value for the DCdifferential.

Additional features and advantages will be made apparent from thefollowing detailed description of various embodiments that proceeds withreference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a chart showing a staircase I/O function for a scalarquantizer according to the prior art.

FIGS. 2a and 2b are charts showing classifiers and thresholds for scalarquantizers according to the prior art.

FIG. 3 is a chart showing a staircase I/O function for a DZ+UTQaccording to the prior art.

FIGS. 4a and 4b are charts showing classifiers and thresholds forDZ+UTQs according to the prior art.

FIG. 5 is a chart showing reconstruction points for differentreconstruction rules for a given pdf shape according to the prior art.

FIG. 6 is a chart showing adjustments to a classifier for a scalarquantizer according to the prior art.

FIG. 7 is a block diagram showing block-based intra-compressionaccording to the prior art.

FIG. 8 is a block diagram of a suitable computing environment in whichseveral described embodiments may be implemented.

FIGS. 9 and 10 are block diagrams of a video encoder system and a videodecoder system, respectively, in conjunction with which severaldescribed embodiments may be implemented.

FIGS. 11A-11D are diagrams for different syntax layers of a bitstream.

FIG. 12 is a listing of DC differential decoding pseudocode.

DETAILED DESCRIPTION

Described embodiments relate to techniques and tools for signaling DCcoefficients at small quantization step sizes. The various techniquesand tools can be used in combination or independently.

I. Computing Environment

FIG. 8 illustrates a generalized example of a suitable computingenvironment (800) in which several of the described embodiments may beimplemented. The computing environment (800) is not intended to suggestany limitation as to scope of use or functionality, as the techniquesand tools may be implemented in diverse general-purpose orspecial-purpose computing environments.

With reference to FIG. 8, the computing environment (800) includes atleast one processing unit (810) and memory (820). In FIG. 8, this mostbasic configuration (830) is included within a dashed line. Theprocessing unit (810) executes computer-executable instructions and maybe a real or a virtual processor. In a multi-processing system, multipleprocessing units execute computer-executable instructions to increaseprocessing power. The memory (820) may be volatile memory (e.g.,registers, cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flashmemory, etc.), or some combination of the two. The memory (820) storessoftware (880) implementing an encoder and/or decoder with specialsignaling of DC coefficients at small quantization step sizes.

A computing environment may have additional features. For example, thecomputing environment (800) includes storage (840), one or more inputdevices (850), one or more output devices (860), and one or morecommunication connections (870). An interconnection mechanism (notshown) such as a bus, controller, or network interconnects thecomponents of the computing environment (800). Typically, operatingsystem software (not shown) provides an operating environment for othersoftware executing in the computing environment (800), and coordinatesactivities of the components of the computing environment (800).

The storage (840) may be removable or non-removable, and includesmagnetic disks, magnetic tapes or cassettes, CD-ROMs, DVDs, or any othermedium which can be used to store information and which can be accessedwithin the computing environment (800). The storage (840) storesinstructions for the software (880) implementing the encoder and/ordecoder.

The input device(s) (850) may be a touch input device such as akeyboard, mouse, pen, or trackball, a voice input device, a scanningdevice, or another device that provides input to the computingenvironment (800). For audio or video encoding, the input device(s)(850) may be a sound card, video card, TV tuner card, or similar devicethat accepts audio or video input in analog or digital form, or a CD-ROMor CD-RW that reads audio or video samples into the computingenvironment (800). The output device(s) (860) may be a display, printer,speaker, CD-writer, or another device that provides output from thecomputing environment (800).

The communication connection(s) (870) enable communication over acommunication medium to another computing entity. The communicationmedium conveys information such as computer-executable instructions,audio or video input or output, or other data in a modulated datasignal. A modulated data signal is a signal that has one or more of itscharacteristics set or changed in such a manner as to encode informationin the signal. By way of example, and not limitation, communicationmedia include wired or wireless techniques implemented with anelectrical, optical, RF, infrared, acoustic, or other carrier.

The techniques and tools can be described in the general context ofcomputer-readable media. Computer-readable media are any available mediathat can be accessed within a computing environment. By way of example,and not limitation, with the computing environment (800),computer-readable media include memory (820), storage (840),communication media, and combinations of any of the above.

The techniques and tools can be described in the general context ofcomputer-executable instructions, such as those included in programmodules, being executed in a computing environment on a target real orvirtual processor. Generally, program modules include routines,programs, libraries, objects, classes, components, data structures, etc.that perform particular tasks or implement particular abstract datatypes. The functionality of the program modules may be combined or splitbetween program modules as desired in various embodiments.Computer-executable instructions for program modules may be executedwithin a local or distributed computing environment.

II. Video Encoder and Decoder

FIG. 9 is a block diagram of a generalized video encoder system (900),and FIG. 10 is a block diagram of a video decoder system (1000), inconjunction with which various described embodiments may be implemented.

The relationships shown between modules within the encoder and decoderindicate the main flow of information in the encoder and decoder; otherrelationships are not shown for the sake of simplicity. In particular,FIGS. 9 and 10 usually do not show side information indicating theencoder settings, modes, tables, etc. used for a video sequence, frame,macroblock, block, etc. Such side information is sent in the outputbitstream, typically after entropy encoding of the side information. Theformat of the output bitstream can be a Windows Media Video version 9 orother format.

The encoder (900) and decoder (1000) are block-based and use a 4:2:0macroblock format, with each macroblock including four 8×8 luminanceblocks (at times treated as one 16×16 macroblock) and two 8×8chrominance blocks. Alternatively, the encoder (900) and decoder (1000)are object-based, use a different macroblock or block format, or performoperations on sets of pixels of different size or configuration than 8×8blocks and 16×16 macroblocks.

Depending on implementation and the type of compression desired, modulesof the encoder or decoder can be added, omitted, split into multiplemodules, combined with other modules, and/or replaced with like modules.In alternative embodiments, encoders or decoders with different modulesand/or other configurations of modules perform one or more of thedescribed techniques.

A. Video Encoder

FIG. 9 is a block diagram of a general video encoder system (900) thatcan perform joint entropy coding and bitstream formation operations forvariable-size transform information. The encoder system (900) receives asequence of video frames including a current frame (905), and producescompressed video information (995) as output. Particular embodiments ofvideo encoders typically use a variation or supplemented version of thegeneralized encoder (900).

The encoder system (900) compresses predicted frames and key frames. Forthe sake of presentation, FIG. 9 shows a path for key frames through theencoder system (900) and a path for forward-predicted frames. Many ofthe components of the encoder system (900) are used for compressing bothkey frames and predicted frames. The exact operations performed by thosecomponents can vary depending on the type of information beingcompressed.

A predicted frame (also called p-frame, b-frame for bi-directionalprediction, or inter-coded frame) is represented in terms of prediction(or difference) from one or more other frames. A prediction residual isthe difference between what was predicted and the original frame. Incontrast, a key frame (also called an I-frame or intra-coded frame) iscompressed without reference to other frames.

If the current frame (905) is a forward-predicted frame, a motionestimator (910) estimates motion of macroblocks or other sets of pixelsof the current frame (905) with respect to a reference frame, which is areconstructed previous frame (925) buffered in the frame store (920). Inalternative embodiments, the reference frame is a later frame or thecurrent frame is bi-directionally predicted. The motion estimator (910)can estimate motion by pixel, ½ pixel, ¼ pixel, or other increments, andcan switch the precision of the motion estimation on a frame-by-framebasis or other basis. The precision of the motion estimation can be thesame or different horizontally and vertically. The motion estimator(910) outputs as side information motion information (915) such asmotion vectors. A motion compensator (930) applies the motioninformation (915) to the reconstructed previous frame (925) to form amotion-compensated current frame (935). The prediction is rarelyperfect, however, and the difference between the motion-compensatedcurrent frame (935) and the original current frame (905) is theprediction residual (945). Alternatively, a motion estimator and motioncompensator apply another type of motion estimation/compensation.

For DC coefficients at small quantization step sizes, the encodersignals DC coefficients using a syntax and code tables such as thosedescribed below. In particular, the encoder uses the code tables andproduces an output bitstream in compliance with the syntax below.

A frequency transformer (960) converts the spatial domain videoinformation into frequency domain (i.e., spectral) data. For block-basedvideo frames, the frequency transformer (960) applies a DCT or variantof DCT to blocks of the pixel data or prediction residual data,producing blocks of DCT coefficients. Alternatively, the frequencytransformer (960) applies another conventional frequency transform suchas a Fourier transform or uses wavelet or subband analysis. Inembodiments in which the encoder uses spatial extrapolation (not shownin FIG. 9) to encode blocks of key frames, the frequency transformer(960) can apply a re-oriented frequency transform such as a skewed DCTto blocks of prediction residuals for the key frame. The frequencytransformer (960) applies an 8×8, 8×4, 4×8, or other size frequencytransforms (e.g., DCT) to prediction residuals for predicted frames.

A quantizer (970) then quantizes the blocks of spectral datacoefficients. The quantizer applies uniform, scalar quantization to thespectral data with a step-size that varies on a frame-by-frame basis orother basis. Alternatively, the quantizer applies another type ofquantization to the spectral data coefficients, for example, anon-uniform, vector, or non-adaptive quantization, or directly quantizesspatial domain data in an encoder system that does not use frequencytransformations. In addition to adaptive quantization, the encoder (900)can use frame dropping, adaptive filtering, or other techniques for ratecontrol.

If a given macroblock in a predicted frame has no information of certaintypes (e.g., no motion information for the macroblock and no residualinformation), the encoder (900) may encode the macroblock as a skippedmacroblock. If so, the encoder signals the skipped macroblock in theoutput bitstream of compressed video information (995).

When a reconstructed current frame is needed for subsequent motionestimation/compensation, an inverse quantizer (976) performs inversequantization on the quantized spectral data coefficients. An inversefrequency transformer (966) then performs the inverse of the operationsof the frequency transformer (960), producing a reconstructed predictionresidual (for a predicted frame) or reconstructed samples (for anintra-coded frame). If the frame (905) being encoded is an intra-codedframe, then the reconstructed samples form the reconstructed currentframe (not shown). If the frame (905) being encoded is a predictedframe, the reconstructed prediction residual is added to themotion-compensated predictions (935) to form the reconstructed currentframe. The frame store (920) buffers the reconstructed current frame foruse in predicting a next frame. In some embodiments, the encoder appliesa deblocking filter to the reconstructed frame to adaptively smoothdiscontinuities between the blocks of the frame.

The entropy coder (980) compresses the output of the quantizer (970) aswell as certain side information (e.g., motion information (915),spatial extrapolation modes, quantization step size). Typical entropycoding techniques include arithmetic coding, differential coding,Huffman coding, run length coding, LZ coding, dictionary coding, andcombinations of the above. The entropy coder (980) typically usesdifferent coding techniques for different kinds of information (e.g., DCcoefficients, AC coefficients, different kinds of side information), andcan choose from among multiple code tables within a particular codingtechnique.

The entropy coder (980) puts compressed video information (995) in thebuffer (990). A buffer level indicator is fed back to bit rate adaptivemodules. The compressed video information (995) is depleted from thebuffer (990) at a constant or relatively constant bit rate and storedfor subsequent streaming at that bit rate. Therefore, the level of thebuffer (990) is primarily a function of the entropy of the filtered,quantized video information, which affects the efficiency of the entropycoding. Alternatively, the encoder system (900) streams compressed videoinformation immediately following compression, and the level of thebuffer (990) also depends on the rate at which information is depletedfrom the buffer (990) for transmission.

Before or after the buffer (990), the compressed video information (995)can be channel coded for transmission over the network. The channelcoding can apply error detection and correction data to the compressedvideo information (995).

B. Video Decoder

FIG. 10 is a block diagram of a general video decoder system (1000). Thedecoder system (1000) receives information (1095) for a compressedsequence of video frames and produces output including a reconstructedframe (1005). Particular embodiments of video decoders typically use avariation or supplemented version of the generalized decoder (1000).

The decoder system (1000) decompresses predicted frames and key frames.For the sake of presentation, FIG. 10 shows a path for key framesthrough the decoder system (1000) and a path for forward-predictedframes. Many of the components of the decoder system (1000) are used fordecompressing both key frames and predicted frames. The exact operationsperformed by those components can vary depending on the type ofinformation being decompressed.

A buffer (1090) receives the information (1095) for the compressed videosequence and makes the received information available to the entropydecoder (1080). The buffer (1090) typically receives the information ata rate that is fairly constant over time, and includes a jitter bufferto smooth short-term variations in bandwidth or transmission. The buffer(1090) can include a playback buffer and other buffers as well.Alternatively, the buffer (1090) receives information at a varying rate.Before or after the buffer (1090), the compressed video information canbe channel decoded and processed for error detection and correction.

The entropy decoder (1080) entropy decodes entropy-coded quantized dataas well as entropy-coded side information (e.g., motion information(1015), spatial extrapolation modes, quantization step size), typicallyapplying the inverse of the entropy encoding performed in the encoder.Entropy decoding techniques include arithmetic decoding, differentialdecoding, Huffman decoding, run length decoding, LZ decoding, dictionarydecoding, and combinations of the above. The entropy decoder (1080)frequently uses different decoding techniques for different kinds ofinformation (e.g., DC coefficients, AC coefficients, different kinds ofside information), and can choose from among multiple code tables withina particular decoding technique.

If the frame (1005) to be reconstructed is a forward-predicted frame, amotion compensator (1030) applies motion information (1015) to areference frame (1025) to form a prediction (1035) of the frame (1005)being reconstructed. For example, the motion compensator (1030) uses amacroblock motion vector to find a macroblock in the reference frame(1025). A frame buffer (1020) stores previous reconstructed frames foruse as reference frames. The motion compensator (1030) can compensatefor motion at pixel, ½ pixel, ¼ pixel, or other increments, and canswitch the precision of the motion compensation on a frame-by-framebasis or other basis. The precision of the motion compensation can bethe same or different horizontally and vertically. Alternatively, amotion compensator applies another type of motion compensation. Theprediction by the motion compensator is rarely perfect, so the decoder(1000) also reconstructs prediction residuals.

When the decoder needs a reconstructed frame for subsequent motioncompensation, the frame store (1020) buffers the reconstructed frame foruse in predicting a next frame. In some embodiments, the encoder appliesa deblocking filter to the reconstructed frame to adaptively smoothdiscontinuities between the blocks of the frame.

An inverse quantizer (1070) inverse quantizes entropy-decoded data. Ingeneral, the inverse quantizer applies uniform, scalar inversequantization to the entropy-decoded data with a step-size that varies ona frame-by-frame basis or other basis. Alternatively, the inversequantizer applies another type of inverse quantization to the data, forexample, a non-uniform, vector, or non-adaptive inverse quantization, ordirectly inverse quantizes spatial domain data in a decoder system thatdoes not use inverse frequency transformations.

An inverse frequency transformer (1060) converts the quantized,frequency domain data into spatial domain video information. Forblock-based video frames, the inverse frequency transformer (1060)applies an IDCT or variant of IDCT to blocks of the DCT coefficients,producing pixel data or prediction residual data for key frames orpredicted frames, respectively. Alternatively, the frequency transformer(1060) applies another conventional inverse frequency transform such asa Fourier transform or uses wavelet or subband synthesis. In embodimentsin which the decoder uses spatial extrapolation (not shown in FIG. 10)to decode blocks of key frames, the inverse frequency transformer (1060)can apply a re-oriented inverse frequency transform such as a skewedIDCT to blocks of prediction residuals for the key frame. The inversefrequency transformer (1060) applies an 8×8, 8×4, 4×8, or other sizeinverse frequency transforms (e.g., IDCT) to prediction residuals forpredicted frames.

The decoder (1000) processes DC coefficient information whenquantization step sizes are small, for example, as described below.

III. Example Bitstream Syntax and Semantics

An example bitstream includes information for a sequence of compressedprogressive video frames or other pictures. The bitstream is organizedinto several hierarchical layers that are decoded by a decoder such asthe decoder (1000) of FIG. 10. The highest layer is the sequence layer,which has information for the overall sequence of frames. Additionally,each compressed video frame is made up of data that is structured intothree hierarchical layers. From top to bottom the layers are: picture,macroblock, and block.

FIG. 11A is a syntax diagram for the sequence layer (1100), whichincludes a sequence header (1110) followed by data for the picture layer(see FIG. 11B). The sequence header (1110) includes severalsequence-level elements that are processed by the decoder and used todecode the sequence, including a macroblock quantization (DQUANT)element (1111) and quantizer specifier (QUANTIZER) element (1112).DQUANT (1111) is a 2-bit field that indicates whether or not thequantization step size can vary within a frame. There are three possiblevalues for DQUANT. If DQUANT=0, then the only one quantization step size(i.e. the frame quantization step size) can be used per frame. IfDQUANT=1 or 2, then it is possible to quantize each of the macroblocksin the frame differently.

The QUANTIZER (1112) is a 2-bit fixed length code [“FLC” ] field thatindicates the quantizer used for the sequence. The quantizer types areencoded according to the following Table 2.

TABLE 2 Quantizer Specification FLC Quantizer specification 00 Quantizerimplicitly specified at frame level 01 Quantizer explicitly specified atframe level 10 5 QP deadzone quantizer used for all frames 11 3 QPdeadzone quantizer used for all frames

FIG. 11B is a syntax diagram for the picture layer (1120) for aprogressive intra-frame [“progressive I-frame” ]. Syntax diagrams forother pictures, such as P-frames and B-frames have many similar syntaxelements. The picture layer (1120) includes a picture header (1130)followed by data for the macroblock layer. The picture header (1130)includes several picture-level elements that are processed by thedecoder and used to decode the corresponding frame. Some of thoseelements are only present if their presence is signaled or implied by asequence-level element or a preceding picture-level element.

For example, the picture header (1130) includes an intra transform DCTtable (DCTDCTAB) element (1137). This field is present in P pictures andbaseline I pictures (X8IF=0). DCTDCTAB (1137) is a 1-bit field thatsignals which of two sets of VLC tables is used to decode the transformDC coefficients in intra-coded blocks. If DCTDCTAB=0, then the lowmotion VLC tables (one for luminance DC, one for chrominance DC) areused. If DCTDCTAB=1 then the high motion VLC tables (one for luminanceDC, one for chrominance DC) are used. The transform DC VLC tables arelisted below.

The picture header (1130) includes a picture quantizer index (PQINDEX)element (1131). PQINDEX (1131) is a 5-bit field that signals thequantizer scale index for the entire frame. It is present in all picturetypes. If the implicit quantizer is used (signaled by sequence fieldQUANTIZER=00, see Table 2 above) then PQINDEX specifies both the picturequantizer scale (PQUANT) and the quantizer (3 QP or 5 QP deadzone) usedfor the frame. Table 3 shows how PQINDEX is translated to PQUANT and thequantizer for implicit mode.

TABLE 3 PQINDEX to PQUANT/Quantizer Deadzone Translation (ImplicitQuantizer) Quantizer PQINDEX PQUANT Deadzone 0 NA NA 1 1 3 QP 2 2 3 QP 33 3 QP 4 4 3 QP 5 5 3 QP 6 6 3 QP 7 7 3 QP 8 8 3 QP 9 6 5 QP 10 7 5 QP11 8 5 QP 12 9 5 QP 13 10 5 QP 14 11 5 QP 15 12 5 QP 16 13 5 QP 17 14 5QP 18 15 5 QP 19 16 5 QP 20 17 5 QP 21 18 5 QP 22 19 5 QP 23 20 5 QP 2421 5 QP 25 22 5 QP 26 23 5 QP 27 24 5 QP 28 25 5 QP 29 27 5 QP 30 29 5QP 31 31 5 QP

If the quantizer is signaled explicitly at the sequence or frame level(signaled by sequence field QUANTIZER=01, 10 or 11, see Table 2 above)then PQINDEX is translated to the picture quantizer step size PQUANT asindicated by Table 4.

TABLE 4 PQINDEX to PQUANT Translation (Explicit Quantizer) PQUANT PQUANT3QP 5QP PQINDEX Deadzone Deadzone 0 NA NA 1 1 1 2 2 1 3 3 1 4 4 2 5 5 36 6 4 7 7 5 8 8 6 9 9 7 10 10 8 11 11 9 12 12 10 13 13 11 14 14 12 15 1513 16 16 14 17 17 15 18 18 16 19 19 17 20 20 18 21 21 19 22 22 20 23 2321 24 24 22 25 25 23 26 26 24 27 27 25 28 28 26 29 29 27 30 30 29 31 3131

Alternatively, instead of the translation shown in Table 4, PQUANT isequal to PQINDEX for all values of PQINDEX from 1 through 31 when thequantizer is signaled explicitly at the sequence or frame level.

The picture header (1130) also includes a half QP step (HALFQP) element(1134) and picture quantizer type (PQUANTIZER) element (1135). HALFQP(1034) is a 1-bit field present if PQINDEX (1033) is less than or equalto 8. HALFQP (1134) allows the picture quantizer to be expressed in halfstep increments over the low PQUANT range. If HALFQP=1 then the picturequantizer step size is PQUANT+½. If HALFQP=0 then the picture quantizerstep size is PQUANT. Therefore, if the 3 QP deadzone quantizer is usedthen half step sizes are possible up to PQUANT=9 (i.e., PQUANT=1, 1.5,2, 2.5 . . . 8.5, 9) and then only integer step sizes are allowableabove PQUANT=9. For the 5 QP deadzone quantizer, half step sizes arepossible up to PQUANT=7 (i.e., 1, 1.5, 2, 2.5 . . . 6.5, 7).

PQUANTIZER (1135) is a 1-bit field present in all frame types if thesequence level field QUANTIZER=01 (see Table 2 above). In this case, thequantizer used for the frame is specified by PQUANTIZER. If PQUANTIZER=0then the 5 QP deadzone quantizer is used for the frame. If PQUANTIZER=1then the 3 QP deadzone quantizer is used.

The picture header (1130) further includes a macroblock quantization(VODPQUANT) field (1136). VODPQUANT (1136) may be used to adjustquantization step sizes for macroblocks (e.g., macroblocks at one ormore edges of a frame, or on a per macroblock basis). For additionaldetail about VODPQUANT (1136), see U.S. patent application Ser. No.10/623,195, filed Jul. 18, 2003.

FIG. 11C is a macroblock-layer (1140) bitstream syntax diagram forprogressive I-frames. The bitstream syntax for the macroblock layer ofP-pictures and B-pictures contain many elements in common. Data for amacroblock consists of a macroblock header (1150) followed byblock-layer data.

FIG. 11D is an intra-coded block-layer (1160) bitstream syntax diagram.The block-layer data includes a transform DC coefficient (DCCOEF)element (1161), an escape transform DC coefficient (DCCOEFESC) element(1162), and a transform DC sign (DCSIGN) element (1163).

The DCCOEF (1161) field is only present in intra-coded blocks. This is avariable-length codeword that encodes a transform DC differential. Thetransform DC decoding process is described further below. One of twosets of code tables is used to encode the DC differentials (the table issignaled in the DCTDCTAB (1137) field in the picture header as describedabove). The DC VLC tables are also listed below.

The DCCOEFESC (1162) field is only present in intra-coded blocks andonly if DCCOEF decodes to the escape code. The size of DCCOEFESC fieldcan be 8, 9 or 10 bits depending on the quantization step size of theblock. DCSIGN (1163) is a 1-bit value that indicates the sign of the DCdifferential. If DCSIGN=0 then the DC differential is positive. IfDCSIGN=1 then the DC differential is negative.

IV. Example Decoding and Dequantization of DC Coefficients for IntraBlocks

For typical intra-coded blocks, a decoder such as the decoder (1000) ofFIG. 10 decodes coefficients, performs inverse quantization, andperforms an inverse transform.

A. Decoding DC Differentials

The DC coefficient is coded differentially with respect to analready-decoded DC coefficient neighbor. This section describes theprocess used to decode the bitstream to obtain the DC differential.

FIG. 11D shows the bitstream elements used to encode/decode the DCdifferential. DCCOEF is decoded using one of two sets of VLC tables (onefor low motion and one for high motion). Each set of VLC tables includesa table for DC differentials for luminance blocks and a table for DCdifferentials for chrominance blocks. The table is specified by theDCTDCTAB (1137) field in the picture header.

Based on the value of DCTDCTAB, one of the VLC tables listed below isused to decode DCCOEF. This will yield either:

-   -   1) zero, or    -   2) the absolute value of the DC differential, or    -   3) the escape code.

If DCCOEF decodes to zero, the value of the DC differential is alsozero. Otherwise, further decoding is done to determine the value of theDC differential. If DCCOEF decodes to the escape code, the absolutevalue of the DC differential is encoded in the DCCOEFESC field. The sizeof the DCCOEFESC field is 8, 9 or 10 bits depending on the quantizationstep size of the block. The sign of the DC differential is obtained fromthe DCSIGN field. FIG. 12 lists pseudocode to illustrate the DCdifferential decoding process.

B. DC Differential VLC Tables

1. Low-motion VLC Tables

TABLE 5 Low-motion Luminance DC Differential VLC Table DC VLCDifferential Codeword VLC Size 0 1 1 1 1 2 2 1 4 3 1 5 4 5 5 5 7 5 6 8 67 12 6 8 0 7 9 2 7 10 18 7 11 26 7 12 3 8 13 7 8 14 39 8 15 55 8 16 5 917 76 9 18 108 9 19 109 9 20 8 10 21 25 10 22 155 10 23 27 10 24 154 1025 19 11 26 52 11 27 53 11 28 97 12 29 72 13 30 196 13 31 74 13 32 19813 33 199 13 34 146 14 35 395 14 36 147 14 37 387 14 38 386 14 39 150 1440 151 14 41 384 14 42 788 15 43 789 15 44 1541 16 45 1540 16 46 1542 1647 3086 17 48 197581 23 49 197577 23 50 197576 23 51 197578 23 52 19757923 53 197580 23 54 197582 23 55 197583 23 56 197584 23 57 197585 23 58197586 23 59 197587 23 60 197588 23 61 197589 23 62 197590 23 63 19759123 64 197592 23 65 197593 23 66 197594 23 67 197595 23 68 197596 23 69197597 23 70 197598 23 71 197599 23 72 197600 23 73 197601 23 74 19760223 75 i97603 23 76 197604 23 77 197605 23 78 197606 23 79 197607 23 80197608 23 81 197609 23 82 197610 23 83 197611 23 84 197612 23 85 19761323 86 197614 23 87 197615 23 88 197616 23 89 197617 23 90 197618 23 91197619 23 92 197620 23 93 197621 23 94 197622 23 95 197623 23 96 19762423 97 197625 23 98 197626 23 99 197627 23 100 197628 23 101 197629 23102 197630 23 103 197631 23 104 395136 24 105 395137 24 106 395138 24107 395139 24 108 395140 24 109 395141 24 110 395142 24 111 395143 24112 395144 24 113 395145 24 114 395146 24 115 395147 24 116 395148 24117 395149 24 118 395150 24 ESCAPE 395151 24

TABLE 6 Low-motion Chroma DC Differential VLC Table DC VLC DifferentialCodeword VLC Size 0 0 2 1 1 2 2 5 3 3 9 4 4 13 4 5 17 5 6 29 5 7 31 5 833 6 9 49 6 10 56 6 11 51 6 12 57 6 13 61 6 14 97 7 15 121 7 16 128 8 17200 8 18 202 8 19 240 8 20 129 8 21 192 8 22 201 8 23 263 9 24 262 9 25406 9 26 387 9 27 483 9 28 482 9 29 522 10 30 523 10 31 1545 11 32 104211 33 1043 11 34 1547 11 35 1041 11 36 1546 11 37 1631 11 38 1040 11 391629 11 40 1630 11 41 3256 12 42 3088 12 43 3257 12 44 6179 13 45 1235714 46 24713 15 47 49424 16 48 3163208 22 49 3163209 22 50 3163210 22 513163211 22 52 3163212 22 53 3163213 22 54 3163214 22 55 3163215 22 563163216 22 57 3163217 22 58 3163218 22 59 3163219 22 60 3163220 22 613163221 22 62 3163222 22 63 3163223 22 64 3163224 22 65 3163225 22 663163226 22 67 3163227 22 68 3163228 22 69 3163229 22 70 3163230 22 713163231 22 72 3163232 22 73 3163233 22 74 3163234 22 75 3163235 22 763163236 22 77 3163237 22 78 3163238 22 79 3163239 22 80 3163240 22 813163241 22 82 3163242 22 83 3163243 22 84 3163244 22 85 3163245 22 863163246 22 87 3163247 22 88 3163248 22 89 3163249 22 90 3163250 22 913163251 22 92 3163252 22 93 3163253 22 94 3163254 22 95 3163255 22 963163256 22 97 3163257 22 98 3163258 22 99 3163259 22 100 3163260 22 1013163261 22 102 3163262 22 103 3163263 22 104 6326400 23 105 6326401 23106 6326402 23 107 6326403 23 108 6326404 23 109 6326405 23 110 632640623 111 6326407 23 112 6326408 23 113 6326409 23 114 6326410 23 1156326411 23 116 6326412 23 117 6326413 23 118 6326414 23 ESCAPE 632641523

TABLE 7 High-motion Luminance DC Differential VLC Table DC VLCDifferential Codeword VLC Size 0 2 2 1 3 2 2 3 3 3 2 4 4 5 4 5 1 5 6 3 57 8 5 8 0 6 9 5 6 10 13 6 11 15 6 12 19 6 13 8 7 14 24 7 15 28 7 16 36 717 4 8 18 6 8 19 18 8 20 50 8 21 59 8 22 74 8 23 75 8 24 11 9 25 38 9 2639 9 27 102 9 28 116 9 29 117 9 30 20 10 31 28 10 32 31 10 33 29 10 3443 11 35 61 11 36 413 11 37 415 11 38 84 12 39 825 12 40 824 12 41 82912 42 171 13 43 241 13 44 1656 13 45 242 13 46 480 14 47 481 14 48 34014 49 3314 14 50 972 15 51 683 15 52 6631 15 53 974 15 54 6630 15 551364 16 56 1951 16 57 1365 16 58 3901 17 59 3895 17 60 3900 17 61 389317 62 7789 18 63 7784 18 64 15576 19 65 15571 19 66 15577 19 67 31140 2068 996538 25 69 996532 25 70 996533 25 71 996534 25 72 996535 25 73996536 25 74 996537 25 75 996539 25 76 996540 25 77 996541 25 78 99654225 79 996543 25 80 1993024 26 81 1993025 26 82 1993026 26 83 1993027 2684 1993028 26 85 1993029 26 86 1993030 26 87 1993031 26 88 1993032 26 891993033 26 90 1993034 26 91 1993035 26 92 1993036 26 93 1993037 26 941993038 26 95 1993039 26 96 1993040 26 97 1993041 26 98 1993042 26 991993043 26 100 1993044 26 101 1993045 26 102 1993046 26 103 1993047 26104 1993048 26 105 1993049 26 106 1993050 26 107 1993051 26 108 199305226 109 1993053 26 110 1993054 26 111 1993055 26 112 1993056 26 1131993057 26 114 1993058 26 115 1993059 26 116 1993060 26 117 1993061 26118 1993062 26 ESCAPE 1993063 26

TABLE 8 High-motion Chroma DC Differential VLC Table DC VLC DifferentialCodeword VLC Size 0 0 2 1 1 2 2 4 3 3 7 3 4 11 4 5 13 4 6 21 5 7 40 6 848 6 9 50 6 10 82 7 11 98 7 12 102 7 13 166 8 14 198 8 15 207 8 16 335 917 398 9 18 412 9 19 669 10 20 826 10 21 1336 11 22 1596 11 23 1598 1124 1599 11 25 1654 11 26 2675 12 27 3194 12 28 3311 12 29 5349 13 306621 13 31 10696 14 32 10697 14 33 25565 15 34 13240 14 35 13241 14 3651126 16 37 25560 15 38 25567 15 39 51123 16 40 51124 16 41 51125 16 4225566 15 43 51127 16 44 51128 16 45 51129 16 46 102245 17 47 204488 1848 13087304 24 49 13087305 24 50 13087306 24 51 13087307 24 52 1308730824 53 13087309 24 54 13087310 24 55 13087311 24 56 13087312 24 5713087313 24 58 13087314 24 59 13087315 24 60 13087316 24 61 13087317 2462 13087318 24 63 13087319 24 64 13087320 24 65 13087321 24 66 1308732224 67 13087323 24 68 13087324 24 69 13087325 24 70 13087326 24 7113087327 24 72 13087328 24 73 13087329 24 74 13087330 24 75 13087331 2476 13087332 24 77 13087333 24 78 13087334 24 79 13087335 24 80 1308733624 81 13087337 24 82 13087338 24 83 13087339 24 84 13087340 24 8513087341 24 86 13087342 24 87 13087343 24 88 13087344 24 89 13087345 2490 13087346 24 91 13087347 24 92 13087348 24 93 13087349 24 94 1308735024 95 13087351 24 96 13087352 24 97 13087353 24 98 13087354 24 9913087355 24 100 13087356 24 101 13087357 24 102 13087358 24 103 1308735924 104 26174592 25 105 26174593 25 106 26174594 25 107 26174595 25 10826174596 25 109 26174597 25 110 26174598 25 111 26174599 25 112 2617460025 113 26174601 25 114 26174602 25 115 26174603 25 116 26174604 25 11726174605 25 118 26174606 25 ESCAPE 26174607 25

C. Computing DC Predictors

The quantized DC value for a current block is obtained by adding a DCpredictor to the DC differential. The DC predictor is obtained from oneof the previously decoded adjacent blocks, which may be labeledcandidate predictors A (from the block immediately above and to the leftof the current block), B (from the block immediately above the currentblock), and C (from the block immediately to the left of the currentblock). The values for A, B and C are the quantized DC values for therespective adjacent blocks.

In some cases there are missing adjacent blocks. If the current block isin the first block row of the frame, there are no A or B (and possiblyno C). If the current block is in the first block column in the frame,there are no A and C (and possibly no B) blocks. For these cases the DCpredictor is set to:

DCPredictor=(1024+(DCStepSize>>1))/DCStepSize,

where DCStepSize is a value described below.

Otherwise, a prediction direction is formed based on the values of A, Band C, and either the B or C predictor is chosen. The predictiondirection is calculated as follows. If the absolute value of (A-B) isless than or equal to the absolute value of (A-C), then the predictionis made from the left (C is the predictor). Otherwise, the prediction ismade from the top (B is the predictor).

The quantized DC coefficient is then calculated by adding the DCdifferential and the DC predictor as follows:

DCCoeffQ=DCPredictor+DCDifferential

D. Inverse-Quantization for Baseline I-Frame Pictures

In each macroblock of a picture frame, the decoder decodes a DCcoefficient and set of AC coefficients, which were each quantized at theencoder. These quantized transform coefficients are dequantized for abaseline I-Frame picture as described below.

1. DC Inverse-Quantization

The quantized DC coefficient (DCCoeffQ) is reconstructed by performingthe following de-quantization operation:

DCCoefficient=DCCoeffQ*DCStepSize

The value of DCStepSize is based on the value of PQUANT as follows:

For PQUANT equal to 1 or 2:

DCStepSize=2*PQUANT

For PQUANT equal to 3 or 4:

DCStepSize=8

For PQUANT greater than or equal to 5:

DCStepSize=PQUANT/2+6

2. Inverse AC Coefficient Quantization

AC coefficients are separately decoded. Depending on whether the 3-QP or5-QP deadzone quantizer is used, the non-zero quantized AC coefficientsare inverse quantized according to the following formula:

dequant_coeff=quant_coeff*double_quqnt(if 3-QP deadzone quantizer), or

dequant_coeff=quant_coeff*double_quant+sign(quant_coeff)*quant_scale

(if 5-QP deadzone quantizer)

where:

quant_coeff is the quantized coefficient

dequant_coeff is the inverse quantized coefficient

double_quant=2*PQUANT+HalfStep

quant_scale=PQUANT

PQUANT is encoded in the picture layer as described above. HalfStep isencoded in the picture layer as via the HALFQP element as describedabove.

V. Signaling for DC Coefficients with Small Quantization Step Sizes,Theory

In the implementation described in detail above, the range fordifferential DC coefficients becomes larger as the quantization stepsize becomes smaller. For example, the range for a quantization stepsize of 2 is twice as large as the range for a quantization step size of4. Further, the range for quantization step size of 1 is four times therange for quantization step size of 4. A VLC table used to directlyencode/decode the differential DC coefficient for such small step sizeswould need to be very large and would impose excessive memoryrequirements in some cases (e.g., in small footprint devices). Further,as the lowest quantization step sizes are infrequently or rarely used inpractical encoding scenarios, the cost of this additional memoryrequirement would not be justified.

The problem of excessively large VLC tables for very small quantizationsizes is addressed in this implementation by designing the VLC tables toaccommodate the range of differential DC coefficients when thequantization step size is 4. Then, for smaller quantization step sizes(e.g., 1 and 2), a multistage approach is used to signal thedifferential DC coefficient. More specifically, at a quantization stepsize of 2, a standard VLC table is used to decode a base VLC for thedifferential DC coefficient. An additional 1-bit code is also decoded,and this is used to refine the value of the differential DC coefficient.At a quantization step size of 1, a standard VLC table again is used todecode a base VLC for the differential DC coefficient. An additional2-bit code is also decoded and used to refine the value of thedifferential DC coefficient.

When the base VLC represents the escape code, a further FLC is used tosignal the differential DC coefficient. The size of the FLC changes withthe quantization step size. For example, the FLC is 8 bits forquantization steps sizes over 2, and 9 and 10 bits for quantization stepsizes of 2 and 1, respectively. This reduces bit rate for the escapecode FLCs for higher quantization step sizes.

Having described and illustrated the principles of our invention, itwill be recognized that the various embodiments can be modified inarrangement and detail without departing from such principles. It shouldbe understood that the programs, processes, or methods described hereinare not related or limited to any particular type of computingenvironment, unless indicated otherwise. Various types of generalpurpose or specialized computing environments may be used with orperform operations in accordance with the teachings described herein.Elements of embodiments shown in software may be implemented in hardwareand vice versa.

In view of the many possible embodiments to which the principles of ourinvention may be applied, we claim as our invention all such embodimentsas may come within the scope and spirit of the following claims andequivalents thereto.

1.-23. (canceled)
 24. In a computer system that implements a videodecoder, a method comprising: receiving encoded data in a bit stream forat least part of a video sequence, wherein the encoded data includes,for a block of a picture of the video sequence: a first code thatindicates a value for a DC differential for a DC coefficient of theblock of the picture, wherein the DC differential represents adifference between the DC coefficient and a DC predictor; and a secondcode that indicates a refinement of the value for the DC differential;and decoding the encoded data, including, for the block of the pictureof the video sequence: decoding the first code to determine the valuefor the DC differential; decoding the second code to determine therefinement of the value for the DC differential; and reconstructing theDC differential using the value for the DC differential and therefinement, including adding the refinement to a multiple of the valuefor the DC differential, wherein the multiple of the value for the DCdifferential is determined by multiplying the value for the DCdifferential by a factor that depends on a quantization step size. 25.The method of claim 24, wherein presence of the second code in thebitstream is conditioned on the quantization step size being 1 or
 2. 26.The method of claim 24, wherein the second code is a fixed length codehaving a length that varies depending on the quantization step size. 27.The method of claim 26, wherein the quantization step size is 1 or 2,and wherein: if the quantization step size is 1, the length of thesecond code is 2 bits; and if the quantization step size is 2, thelength of the second code is 1 bit.
 28. The method of claim 24, whereinthe first code is a variable length code, and wherein the second code isa fixed length code.
 29. The method of claim 24, wherein thequantization step size is 1, and wherein the reconstructing includesperforming operations according to:DCDifferential=DCDifferential*4+flc_decode(2)−3, where DCDifferentialindicates the value for the DC differential and flc_decode(2) representsthe refinement.
 30. The method of claim 24, wherein the quantizationstep size is 2, and wherein the reconstructing includes performingoperations according to:DCDifferential=DCDifferential*2+flc_decode(1)−1, where DCDifferentialindicates the value for the DC differential and flc_decode(2) representsthe refinement.
 31. The method of claim 24, further comprising decodinga third code that represents a sign for the DC differential, wherein thereconstructing also uses the sign for the DC differential.
 32. One ormore computer-readable memory or storage devices having stored thereoncomputer-executable instructions for causing one or more processingunits, when programmed thereby, to perform operations comprising:receiving encoded data in a bit stream for at least part of a videosequence, wherein the encoded data includes, for a block of a picture ofthe video sequence: a first code that indicates a value for a DCdifferential for a DC coefficient of the block of the picture, whereinthe DC differential represents a difference between the DC coefficientand a DC predictor; and a second code that indicates a refinement of thevalue for the DC differential; and decoding the encoded data, including,for the block of the picture of the video sequence: decoding the firstcode to determine the value for the DC differential; decoding the secondcode to determine the refinement of the value for the DC differential;and reconstructing the DC differential using the value for the DCdifferential and the refinement, including adding the refinement to amultiple of the value for the DC differential, wherein the multiple ofthe value for the DC differential is determined by multiplying the valuefor the DC differential by a factor that depends on a quantization stepsize.
 33. The one or more computer-readable memory or storage devices ofclaim 32, wherein presence of the second code in the bitstream isconditioned on the quantization step size being 1 or
 2. 34. The one ormore computer-readable memory or storage devices of claim 32, whereinthe second code is a fixed length code having a length that variesdepending on the quantization step size.
 35. The one or morecomputer-readable memory or storage devices of claim 34, wherein thequantization step size is 1 or 2, and wherein: if the quantization stepsize is 1, the length of the second code is 2 bits; and if thequantization step size is 2, the length of the second code is 1 bit. 36.The one or more computer-readable memory or storage devices of claim 32,wherein the quantization step size is 1, and wherein the reconstructingincludes performing operations according to:DCDifferential=DCDifferential*4+flc_decode(2)−3, where DCDifferentialindicates the value for the DC differential and flc_decode(2) representsthe refinement.
 37. The one or more computer-readable memory or storagedevices of claim 32, wherein the quantization step size is 2, andwherein the reconstructing includes performing operations according to:DCDifferential=DCDifferential*2+flc_decode(1)−1, where DCDifferentialindicates the value for the DC differential and flc_decode(2) representsthe refinement.
 38. The one or more computer-readable memory or storagedevices of claim 32, further comprising decoding a third code thatrepresents a sign for the DC differential, wherein the reconstructingalso uses the sign for the DC differential.
 39. A computer systemcomprising memory and one or more processing units, wherein the computersystem implements a video decoder configured to perform operationscomprising: receiving encoded data in a bit stream for at least part ofa video sequence, wherein the encoded data includes, for a block of apicture of the video sequence: a first code that indicates a value for aDC differential for a DC coefficient of the block of the picture,wherein the DC differential represents a difference between the DCcoefficient and a DC predictor; and a second code that indicates arefinement of the value for the DC differential; and decoding theencoded data, including, for the block of the picture of the videosequence: decoding the first code to determine the value for the DCdifferential; decoding the second code to determine the refinement ofthe value for the DC differential; and reconstructing the DCdifferential using the value for the DC differential and the refinement,including adding the refinement to a multiple of the value for the DCdifferential, wherein the multiple of the value for the DC differentialis determined by multiplying the value for the DC differential by afactor that depends on a quantization step size.
 40. The computer systemof claim 39, wherein the second code is a fixed length code having alength that varies depending on the quantization step size.
 41. Thecomputer system of claim 40, wherein the quantization step size is 1 or2, and wherein: if the quantization step size is 1, the length of thesecond code is 2 bits; and if the quantization step size is 2, thelength of the second code is 1 bit.
 42. The computer system of claim 39,wherein the quantization step size is 1, and wherein the reconstructingincludes performing operations according to:DCDifferential=DCDifferential*4+flc_decode(2)−3, where DCDifferentialindicates the value for the DC differential and flc_decode(2) representsthe refinement.
 43. The computer system of claim 39, wherein thequantization step size is 2, and wherein the reconstructing includesperforming operations according to:DCDifferential=DCDifferential*2+flc_decode(1)−1, where DCDifferentialindicates the value for the DC differential and flc_decode(2) representsthe refinement.